Self-Organized Similarity based Kernel Fuzzy Clustering Model and Its Applications

نویسندگان

  • Tomoyuki Kuwata
  • Mika Sato-Ilic
چکیده

The purpose of this paper is to improve the performance of the kernel fuzzy clustering model by introducing a self-organized algorithm. A conventional kernel fuzzy clustering model is defined as a model which is an improved additive fuzzy clustering. The purpose of this conventional model is to obtain a clearer result by consideration of the interaction of clusters. This paper proposes a fuzzy clustering model based on the idea of self-organized dissimilarity between two objects.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analyse Power Consumption by Mobile Applications Using Fuzzy Clustering Approach

With the advancements in mobile technology and its utilization in every facet of life, mobile popularity has enhanced exponentially. The biggest constraint in the utility of mobile devices is that they are powered with batteries. Optimizing mobile’s size and weight is always the choice of designer, which led limited size and capacity of battery used in mobile phone. In this paper analysis of th...

متن کامل

A Hybrid Time Series Clustering Method Based on Fuzzy C-Means Algorithm: An Agreement Based Clustering Approach

In recent years, the advancement of information gathering technologies such as GPS and GSM networks have led to huge complex datasets such as time series and trajectories. As a result it is essential to use appropriate methods to analyze the produced large raw datasets. Extracting useful information from large data sets has always been one of the most important challenges in different sciences,...

متن کامل

Link-based Community Detection with the Commute-Time Kernel

The main purpose of this work is to find communities in a weighted, undirected, graph by using kernel-based clustering methods, directly partitioning the graph according to a well-defined similarity measure between the nodes (a kernel on a graph). The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel (KCT), providing a meaningful similarity measure between any c...

متن کامل

Clustering with Kernel-Based Self-Organized Maps trained with Supervised Bias

Self-Organized Maps (SOMs) are a popular approach for clustering data. However, most SOM based approaches ignore prior knowledge about potential categories. Also, Self Organized Map (SOM) based approaches usually develop topographic maps with disjoint and uniform activation regions that correspond to a hard clustering of the patterns at their nodes. We present a novel Self-Organizing map, the K...

متن کامل

New distance and similarity measures for hesitant fuzzy soft sets

The hesitant fuzzy soft set (HFSS), as a combination of hesitant fuzzy and soft sets, is regarded as a useful tool for dealing with the uncertainty and ambiguity of real-world problems. In HFSSs, each element is defined in terms of several parameters with arbitrary membership degrees. In addition, distance and similarity measures are considered as the important tools in different areas such as ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009